Adaptive Collapsing on Bounding Volume Hierarchies for Ray-Tracing
نویسنده
چکیده
Ray tracing is a computationally intensive process, several tree data structures and heuristics have been developed to optimize it. This paper presents a new heuristic in the area, based on collapsing some nodes in order to achieve a smaller expected number of node-tests. Two ways of using this heuristic in Bounding Volume Hierarchies are presented as well as the cost-model used to drive the heuristic development and measure it’s efficiency. Some procedures on integrating this heuristic with other optimizations are also discussed.
منابع مشابه
Using Projection to Accelerate Ray Tracing
Using Projection to accelerate Ray Tracing Anastasia Bezerianos M.Sc. Graduate Department of Computer Science University of Toronto 2001 The high cost of Ray Tracing image rendering has driven many researchers to devise acceleration techniques like bounding volume hierarchies. This thesis introduces new ways of building bounding volume hierarchies. We modify existing algorithms to use bounding ...
متن کاملRay Tracing with the Single Slab Hierarchy
Bounding volume hierarchies have become a very popular way to speed up ray tracing. In this paper we present a novel traversal and approximation scheme for bounding volume hierarchies, which is comparable in speed, has a very compact traversal algorithm and uses only 25% of the memory, compared to a standard bounding volume hierarchy.
متن کاملAutomatic Bounding Volume Hierarchy Generation Using Stochastic Search Methods
A bounding volume hierarchy is a common method for making ray tracing based rendering more efficient. Constructing good hierarchies, however, is a difficult problem as the number of hierarchies grows exponentially with the number of scene objects. In this paper, we attempted to apply stochastic search to techniques to solve the problem of automatic generation of bounding volume hierarchy. We ha...
متن کاملUsing Half-Precision Floating-Point Numbers for Storing Bounding Volume Hierarchies
Bounding volume hierarchies, which are commonly used to speed up ray tracing, are heavily accessed during ray traversal. Reducing the memory footprint for the bounding volume hierarchies leads to a better cache hit ratio and, therefore, faster ray tracing. This paper examines an approach of using 16-bit halfprecision floating-point numbers to store bounding volume hierarchy inner nodes. Compare...
متن کاملMemory-Conserving Bounding Volume Hierarchies with Coherent Raytracing
Bounding volume hierarchies (BVH) are a commonly-used method for speeding up ray tracing, but they can consume a large amount of memory for complex scenes. We present a new scheme for storing BVHs that reduces the storage requirements by up to 79%. This scheme has significant computational overhead, but this can be reduced to negligible levels by shooting bundles of rays through the BVH (cohere...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010